Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
نویسندگان
چکیده
منابع مشابه
Multi-hop Wireless Network Emulation on StarBED
In this paper, we present an architecture to emulate multihop wireless networks on StarBED, a wired-network testbed at Hokuriku Research Center of NICT, Japan. The architecture uses a distributed approach, and it can effectively emulate in real time the properties of WLAN contention-based media access mechanism.
متن کاملCooperative Routing in Multi-Radio Multi-Hop Wireless Network
There are many recent interests on cooperative communication (CC) in wireless networks. Despite the large capacity gain of CC in small wireless networks, CC can result in severe interference in large networks and even degraded throughput. The aim of this chapter is to concurrently exploit multi-radio and multi-channel (MRMC) and CC technique to combat co-channel interference and improve the per...
متن کاملEnergy-Efficient Size Approximation of Radio Networks with No Collision Detection
Algorithms for radio networks are studied in two scenarios: (a) the number of active stations is known (or approximately known) (b) the number of active stations is unknown. In the second (more realistic) case it is much harder to design efficient algorithms. For this reason, we design an efficient randomized algorithm for a single-hop radio network that approximately counts the number of its a...
متن کاملEfficient Information Exchange in Single-Hop Multi-Channel Radio Networks
This paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest timeslots. By using Θ( √ n) channels, the previous best result [9] showed that this problem can be solved in Θ(k) time slots with high probability even if k is unknown and no bounds on ...
متن کاملCorrecting Sorted Sequences in a Single Hop Radio Network
By k-disturbed sequence we mean a sequence obtained from a sorted sequence by changing the values of at most k elements. We present an algorithm for single-hop radio networks that sorts a k-disturbed sequence of length n (where each station stores single key) in time 4n+ k · (⌈lg k⌉+⌈lg(n−k+1)⌉+6⌈lg k⌉)−2 with energetic cost 3·⌈ (⌈lg k⌉+1)(⌈lg k⌉+2) 2⌊n/k⌋ ⌉+ 4 · ⌈ ⌈lg k⌉ ⌊n/k⌋ ⌉+ 10. If (⌈lg k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1991
ISSN: 0178-2770,1432-0452
DOI: 10.1007/bf02259748